import java.util.*;

public class Test13 {
    

    public static void main02(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            int n = in.nextInt();
            String str = in.next();
            Map<Character, Integer> hash = new HashMap<>();

            int max = 0;
            char[] c = new char[n + 1];
            int i = 0;
            for (char ch : str.toCharArray()) {
                // 用来记录str中各个数字出现的次数
                hash.put(ch, hash.getOrDefault(ch, 0) + 1);
                c[i++] = ch;
                max = (max > hash.get(ch)) ? max : hash.get(ch);
            }
            if (n - max > max - 1) {
                System.out.println("yes");
                int count = 0;
                StringBuilder s = new StringBuilder();
                while (count != n) {
                    for (int j = 0; j < n; j++) {
                        if(count!=0){
                            if (s.charAt(count-1) == c[j] || c[j] == '0') {
                                j++;
                            }else{
                                s.append(c[j]);
                                c[j] ='0';
                                count++;
                            }

                        } else {
                            s.append(c[j]);
                            count++;
                        }
                    }
                }
                System.out.println(s);
            } else {
                System.out.println("no");
            }

        }
    }

    public int maxLength (int[] arr) {
        int n=arr.length;
        Map<Integer,Integer> hash=new HashMap<>();
        int ret=0;

        for(int left=0,right=0;right<n;right++){
            int in=arr[right];
            hash.put(in,hash.getOrDefault(in,0)+1);

            while(hash.get(in) > 1){
                int out=arr[left++];
                hash.put(out,hash.get(out)-1);
            }
            ret=Math.max(ret,right-left+1);
        }
        return ret;
    }







    public static void main01(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        while (T-- != 0) {
            int n = in.nextInt();
            int k = in.nextInt();
            String str = in.next();
            int sum = 0;
            char[] ch = str.toCharArray();
            int ret = 0;
            for (int left = 0, right = 0; right < n; right++) {
                if (ch[right] == 'W') {
                    if( right!=0&&ch[right-1] == 'L' ){
                        left=right;
                    }
                    sum+=1;
                    if (right - left+1 >= 3) {
                        sum +=k-1;
                    }
                }else{
                    sum -= 1;
                }



            }
            System.out.println(sum);
        }

    }
}
